Weighted finite automata over strong bimonoids
نویسندگان
چکیده
We investigate weighted finite automata over strings and strong bimonoids. Such algebraic structures satisfy the same laws as semirings except that no distributivity laws need to hold. We define two different behaviors and prove precise characterizations for them if the underlying strong bimonoid satisfies local finiteness conditions. Moreover, we show that in this case the given weighted automata can be determinized.
منابع مشابه
Determinization of weighted finite automata over strong bimonoids
We consider weighted finite automata over strong bimonoids, where these weight structures can be considered as semirings which might lack distributivity. Then, in general, the well-known run semantics, initial algebra semantics, and transition semantics of an automaton are different. We prove an algebraic characterization for the initial algebra semantics in terms of stable finitely generated s...
متن کاملWeighted Tree Automata over Strong Bimonoids
We consider weighted tree automata over strong bimonoids which are, roughly speaking, semirings without distributivity. We prove sufficient and necessary conditions under which the initial algebra semantics and the run semantics of these automata coincide. We prove closure properties of the class of recognizable tree series, a determinization result, and a characterization of recognizable step ...
متن کاملA Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices
We study weighted trace automata with weights in strong bimonoids. Traces form a generalization of words that allow to model concurrency; strong bimonoids are algebraic structures that can be regarded as “semirings without distributivity”. A very important example for the latter are bounded lattices, especially non-distributive ones. We show that if both operations of the bimonoid are locally f...
متن کاملThe algebraic characterizations for a formal power series over complete strong bimonoids
On the basis of run semantics and breadth-first algebraic semantics, the algebraic characterizations for a classes of formal power series over complete strong bimonoids are investigated in this paper. As recognizers, weighted pushdown automata with final states (WPDAs for short) and empty stack (WPDAs[Formula: see text]) are shown to be equivalent based on run semantics. Moreover, it is demonst...
متن کاملWeighted Regular Tree Grammars with Storage
We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids. Each weighted regular tree grammar with storage generates a weighted tree language, which is a mapping from the set of trees to the multioperator monoid. We prove that, for multioperator monoids canonically associated to par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 180 شماره
صفحات -
تاریخ انتشار 2010